Leader Election Algorithms in Torus and Hypercube Networks Comparisons and Survey
نویسنده
چکیده
Leader failure is one of the most fundamental problems in distributed systems. This problem can be solved by Leader Election Algorithms (LEAs). These algorithms move the system from an initial state where all the nodes are in the same computation state into a new state where only one node is distinguished computationally (called leader) and all other nodes aware of this leader. This research aims to make survey for leader election algorithms in the most popular network topologies hypercube and torus networks. Comparisons will be made between algorithms in these networks using fixed number of nodes. Keywords— Hypercube, Torus, Leader Election, Distributed Systems, Link failure
منابع مشابه
Leader Election Algorithm in Hypercubes with the Presence
Leader Election is a fundamental problem in centralized control of distributed systems. The election process starts when one or more processors discover that the leader has failed, and it terminates when the remaining processors know who the new leader is. This study presents a distributed solution to this problem in Hypercube networks considering the link failure. A distributed leader election...
متن کاملLeader Election Algorithm in 2D Torus Networks with the Presence of One Link Failure
Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimensional torus networks. The algorithm aims to elect one node to be a new leader. The new leader is identified by some characteristics not in the other nodes in the network. When the process is terminated, the network is r...
متن کاملLeader Election Algorithm in 3D Torus Networks with the Presence of One Link Failure
Leader election is the process of choosing a leader for symmetry breaking where each node in the network eventually decides whether it is a leader or not. This paper proposes a new leader election algorithm to solve the problem of leader failure in three dimensional torus networks. The proposed algorithm solves the election problem despite the existent of link failure. In a network of N nodes c...
متن کاملLeader Election Algorithm in Hypercube Netwok When the Id Number Is Not Distinguished
One of the most critical problems in distributed systems is Leader Failure. Distributed network becomes unstable without leadership. To solve this problem Leader Election algorithm is executed to give the leadership to other processor. The election process starts when one or more processor discovers that leader has failed, and it terminates when the remaining processors know who the new leader ...
متن کاملSublinear Bounds for Randomized Leader Election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...
متن کامل